Learning with noisy labels is a vital topic for practical deep learning as models should be robust to noisy open-world datasets in the wild. The state-of-the-art noisy label learning approach JoCoR fails when faced with a large ratio of noisy labels. Moreover, selecting small-loss samples can also cause error accumulation as once the noisy samples are mistakenly selected as small-loss samples, they are more likely to be selected again. In this paper, we try to deal with error accumulation in noisy label learning from both model and data perspectives. We introduce mean point ensemble to utilize a more robust loss function and more information from unselected samples to reduce error accumulation from the model perspective. Furthermore, as the flip images have the same semantic meaning as the original images, we select small-loss samples according to the loss values of flip images instead of the original ones to reduce error accumulation from the data perspective. Extensive experiments on CIFAR-10, CIFAR-100, and large-scale Clothing1M show that our method outperforms state-of-the-art noisy label learning methods with different levels of label noise. Our method can also be seamlessly combined with other noisy label learning methods to further improve their performance and generalize well to other tasks. The code is available in https://github.com/zyh-uaiaaaa/MDA-noisy-label-learning.

本文研究了一个新的多设备边缘人工智能（AI）系统，该系统共同利用AI模型分配推理和集成感应和通信（ISAC），以在网络边缘启用低延迟智能服务。在此系统中，多个ISAC设备执行雷达传感以获取多视图数据，然后将提取功能的量化版本卸载到集中式边缘服务器，该功能基于级联功能向量进行模型推断。在此设置和考虑分类任务下，我们通过采用近似但可拖动的度量，即判别增益来衡量推理的准确性，该指标定义为在归一化协方差下欧几里得特征空间中两个类别的距离。为了最大化判别增益，我们首先用衍生的封闭形式表达来量化感应，计算和通信过程的影响。然后，通过将这三个过程集成到联合设计中来开发面向任务的端到端资源管理方法。然而，这种集成的感应，计算和通信（ISCC）设计方法然而，由于判别增益的复杂形式和设备异质性在渠道增益，量化水平和生成的功能方面，导致了具有挑战性的非凸优化问题子集。值得注意的是，可以根据比率方法来最佳解决所考虑的非凸问题。这给出了最佳ISCC方案，该方案共同确定多个设备的传输功率和时间分配，以进行传感和通信，以及它们的量化位分配以进行计算失真控制。通过将人类运动识别作为具体的AI推理任务，进行了广泛的实验来验证我们衍生的最佳ISCC方案的性能。

图形神经网络（GNN）在许多基于图的应用程序中取得了巨大成功。但是，巨大的尺寸和高稀疏度的图表阻碍了其在工业场景下的应用。尽管为大规模图提出了一些可扩展的GNN，但它们为每个节点采用固定的$ k $ hop邻域，因此在稀疏区域内采用大型繁殖深度时面临过度光滑的问题。为了解决上述问题，我们提出了一种新的GNN体系结构 - 图形注意多层感知器（GAMLP），该架构可以捕获不同图形知识范围之间的基本相关性。我们已经与天使平台部署了GAMLP，并进一步评估了现实世界数据集和大规模工业数据集的GAMLP。这14个图数据集的广泛实验表明，GAMLP在享有高可扩展性和效率的同时，达到了最先进的性能。具体来说，在我们的大规模腾讯视频数据集上的预测准确性方面，它的表现优于1.3 \％，同时达到了高达$ 50 \ times $ triending的速度。此外，它在开放图基准的最大同质和异质图（即OGBN-PAPERS100M和OGBN-MAG）的排行榜上排名第一。

K-Core Deconnosition是一个常用的指标来分析图形结构或研究节点在复杂图中的相对重要性。近年来，图表的规模迅速增长，特别是在工业环境中。例如，我们的工业伙伴以数十亿用户运行流行的社交应用程序，并且能够收集丰富的用户数据。因此，对大型图形的k核分解应用于学术界和行业的越来越多的关注。处理大图的简单但有效的方法是在分布式设置中训练它们，并且还提出了一些分布式k核分解算法。尽管他们有效性，我们在实验和理论上观察到这些算法消耗了太多资源，并在超大型图表上变得不稳定，特别是当给定的资源有限时。在本文中，我们处理那些超大型图形，并在分布式K核分解算法的顶部提出了分行和征服策略。我们在三个大图中评估我们的方法。实验结果表明，资源的消耗可以显着降低，大规模图的计算比现有方法更稳定。例如，分布式K-Core分解算法可以缩放到具有1360亿边缘的大图，而不会与我们的分行和征服技术丢失正确性。

雅典娜2.0是一家亚历克萨奖的社会奖，这是最后两个Alexa奖奖挑战的决赛。雅典娜成功的一个原因是其新的对话管理战略，它允许它动态构建组件模块的对话和响应，导致每个互动的新型对话。在这里，我们在20/21竞争期间描述了Athena的Alexa奖的系统设计和性能。雅典娜的活跃演示以及视频录音将挑起对话AI的艺术状态的讨论。

3D空间中的空间结构对于确定分子特性是重要的。最近的论文使用几何深度学习来代表分子和预测性质。然而，这些论文在捕获输入原子的远程依赖性时在计算上昂贵;并且尚未考虑外部距离的不均匀性，因此未能学习不同尺度的上下文依赖表示。为了处理这些问题，我们引入了3D变压器，变压器的变型，用于结合3D空间信息的分子表示。 3D变压器在完全连接的图形上运行，在原子之间的直接连接。为了应对外部距离的不均匀性，我们开发了一种多尺度的自我关注模块，利用局部细粒度模式随着越来越多的上下文尺度来利用局部细粒度模式。由于不同尺寸的分子依赖于不同种类的空间特征，我们设计了一种自适应位置编码模块，用于针对小型和大分子采用不同的位置编码方法。最后，为了获得原子嵌入的分子表示，我们提出了一种殷勤最远的点采样算法，该算法在注意分数的帮助下选择一部分原子，克服虚拟节点的障碍和先前的距离 - 优势下采样方法。我们通过三个重要的科学域验证3D变压器：量子化学，物质科学和蛋白质组学。我们的实验表现出对晶体性能预测任务和蛋白质 - 配体结合亲和预测任务的最先进模型的显着改善，并且在量子化学分子数据集中显示了更好或更有竞争的性能。这项工作提供了明确的证据表明，生物化学任务可以从3D分子表示中获得一致的益处，不同的任务需要不同的位置编码方法。

Graph神经网络（GNN）最近在许多基于图的应用程序中都实现了最先进的性能。尽管具有很高的表现力，但他们通常需要在多个培训时期进行昂贵的递归邻里扩展，并面临可伸缩性问题。此外，它们中的大多数是不灵活的，因为它们仅限于固定跳跃社区，并且对不同节点的实际接受场需求不敏感。我们通过引入可扩展且灵活的图表多层感知器（GAMLP）来规避这些限制。随着非线性转化和特征传播的分离，GAMLP通过以预先计算的方式执行传播程序来显着提高可伸缩性和效率。有了三个原则的接受场注意力，GAMLP中的每个节点都具有灵活性和适应性，以利用接收场的不同尺寸的传播特征。我们对三个大型开放图基准（例如OGBN-PAPERS100M，OGBN产品和OGBN-MAG）进行了广泛的评估，这表明GAMLP不仅可以实现前面的性能，而且还提供了较高的可扩展性和效率。

A recent study has shown a phenomenon called neural collapse in that the within-class means of features and the classifier weight vectors converge to the vertices of a simplex equiangular tight frame at the terminal phase of training for classification. In this paper, we explore the corresponding structures of the last-layer feature centers and classifiers in semantic segmentation. Based on our empirical and theoretical analysis, we point out that semantic segmentation naturally brings contextual correlation and imbalanced distribution among classes, which breaks the equiangular and maximally separated structure of neural collapse for both feature centers and classifiers. However, such a symmetric structure is beneficial to discrimination for the minor classes. To preserve these advantages, we introduce a regularizer on feature centers to encourage the network to learn features closer to the appealing structure in imbalanced semantic segmentation. Experimental results show that our method can bring significant improvements on both 2D and 3D semantic segmentation benchmarks. Moreover, our method ranks 1st and sets a new record (+6.8% mIoU) on the ScanNet200 test leaderboard. Code will be available at https://github.com/dvlab-research/Imbalanced-Learning.

Knowledge graph embedding (KGE), which maps entities and relations in a knowledge graph into continuous vector spaces, has achieved great success in predicting missing links in knowledge graphs. However, knowledge graphs often contain incomplete triples that are difficult to inductively infer by KGEs. To address this challenge, we resort to analogical inference and propose a novel and general self-supervised framework AnKGE to enhance KGE models with analogical inference capability. We propose an analogical object retriever that retrieves appropriate analogical objects from entity-level, relation-level, and triple-level. And in AnKGE, we train an analogy function for each level of analogical inference with the original element embedding from a well-trained KGE model as input, which outputs the analogical object embedding. In order to combine inductive inference capability from the original KGE model and analogical inference capability enhanced by AnKGE, we interpolate the analogy score with the base model score and introduce the adaptive weights in the score function for prediction. Through extensive experiments on FB15k-237 and WN18RR datasets, we show that AnKGE achieves competitive results on link prediction task and well performs analogical inference.

When using LiDAR semantic segmentation models for safety-critical applications such as autonomous driving, it is essential to understand and improve their robustness with respect to a large range of LiDAR corruptions. In this paper, we aim to comprehensively analyze the robustness of LiDAR semantic segmentation models under various corruptions. To rigorously evaluate the robustness and generalizability of current approaches, we propose a new benchmark called SemanticKITTI-C, which features 16 out-of-domain LiDAR corruptions in three groups, namely adverse weather, measurement noise and cross-device discrepancy. Then, we systematically investigate 11 LiDAR semantic segmentation models, especially spanning different input representations (e.g., point clouds, voxels, projected images, and etc.), network architectures and training schemes. Through this study, we obtain two insights: 1) We find out that the input representation plays a crucial role in robustness. Specifically, under specific corruptions, different representations perform variously. 2) Although state-of-the-art methods on LiDAR semantic segmentation achieve promising results on clean data, they are less robust when dealing with noisy data. Finally, based on the above observations, we design a robust LiDAR segmentation model (RLSeg) which greatly boosts the robustness with simple but effective modifications. It is promising that our benchmark, comprehensive analysis, and observations can boost future research in robust LiDAR semantic segmentation for safety-critical applications.